NEW UNDERESTIMATOR FOR MULTIVARIATE GLOBAL OPTIMIZATION WITH BOX CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
New Underestimator for Multivariate Global Optimization with Box Constraints
The paper is concerned with the multivariate global optimization with box constraints. A new underestimator is investigated for twice continuously differentiable function on a box which is an extension of the approach developed in [5] for univariate global optimization. AMS Subject Classification: 65K05, 90C30, 90C34
متن کاملA New Algorithm for Box-Constrained Global Optimization
An important class of deterministic methods for global optimization is based on the theory of terminal attractors and repellers. Unfortunately, the utilization of scalar repellers is unsuitable, when the dimension n of the problem assumes values of operational interest. In previous papers the author et alii showed that BFSG-type methods, approximating the Hessian of twice continuously different...
متن کاملCut generation for optimization problems with multivariate risk constraints
We consider a class of multicriteria stochastic optimization problems that features benchmarking constraints based on conditional value-at-risk and second-order stochastic dominance. We develop alternative mixedinteger programming formulations and solution methods for cut generation problems arising in optimization under such multivariate risk constraints. We give the complete linear descriptio...
متن کاملGlobal Optimality Principles for Polynomial Optimization Problems over Box or Bivalent Constraints by Separable Polynomial Approximations∗
In this paper we present necessary conditions for global optimality for polynomial problems over box or bivalent constraints using separable polynomial relaxations. We achieve this by completely characterizing global optimality of separable polynomial problems with box as well as bivalent constraints. Then, by employing separable polynomial under-estimators, we establish sufficient conditions f...
متن کاملTest Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
Abstract. In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. Two sets of test problems are introduced, in the first one both the objective function and constraints are differentiable functions and in the second one they are non-differentiable. Each series of tests contains 3 problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2013
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v84i1.5